Complex Modeling of Matrix Parallel Algorithms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complex modeling of matrix parallel algorithms

Parallel principles are the most effective way how to increase performance in parallel computing (parallel computers and algorithms too). In this sense the paper is devoted to a complex performance evaluation of matrix parallel algorithms (MPA). At first the paper describes the typical matrix parallel algorithms and then it summarizes common properties of them to complex performance modeling of...

متن کامل

Parallel Algorithms for Matrix Normal Forms

Here we offer a new randomized parallel algorithm that determines the Smith normal form of a matrix with entries being univariate polynomials with coefficients in an arbitrary field. The algorithm has two important advantages over our previous one: the multipliers relating the Smith form to the input matrix are computed, and the algorithm is probabilistic of Las Vegas type, i.e., always finds t...

متن کامل

Combinatorial Algorithms for Parallel Sparse Matrix Distributions

Combinatorial algorithms have long played a crucial enabling role in parallel computing. An important problem in sparse matrix computations is how to distribute the sparse matrix and vectors among processors. We review graph, bipartite graph, and hypergraph models for both 1d (row or column) distributions and 2d distributions. A valuable tool is hypergraph partitioning. We present results using...

متن کامل

ON CONEIGENVALUES OF A COMPLEX SQUARE MATRIX

In this paper, we show that a matrix A in Mn(C) that has n coneigenvectors, where coneigenvaluesassociated with them are distinct, is condiagonalizable. And also show that if allconeigenvalues of conjugate-normal matrix A be real, then it is symmetric.  

متن کامل

Analysis of a Class of Parallel Matrix Multiplication Algorithms

A Technical Paper Submitted to IPPS 98 y Abstract Publications concerning parallel implementation of matrix-matrix multiplication continue to appear with some regularity. It may seem odd that an algorithm that can be expressed as one statement and three nested loops deserves this much attention. This paper provides some insights as to why this problem is complex: Practical algorithms that use m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Journal of Networks and Communications

سال: 2014

ISSN: 2326-893X

DOI: 10.11648/j.ajnc.s.2014030501.11